Nature Inspired Algorithms To Solve DNA Fragment Assembly Problem: A Survey
نویسندگان
چکیده
منابع مشابه
Nature Inspired Algorithms to Solve Dna Fragment Assembly Problem: a Survey
Evolutionary search algorithms are becoming an essential advantage in the algorithmic toolbox for solving multi-dimensional optimization problems in a wide range of bioinformatics problems such as Genome fragment assembly which is a NP-hard problem. In computational biology, one of the most challenging problems is to reconstruct the original DNA sequence from a huge number of fragments, each on...
متن کاملDNA Fragment Assembly Using Optimization From nature inspired algorithms to formal methods
The DNA fragment assembly is an important phase required to obtain complete genomes. Optimization using nature inspired algorithms has been proposed by several authors. We present another nature inspired algorithm based on Particle Swarm Optimization and Differential Evolution. These algorithms are compared using a set of common benchmarks and show that our proposed algorithm has some advantage...
متن کاملHeuristically Tuned GA to Solve Genome Fragment Assembly Problem [CEC7600]
We proposed a genetic algorithm (GA) approach to solve the genome sequencing problem. The main contribution of this work is to add two ideas to improve the efficiency of the algorithm (1) a Chromosome Reduction Step (CRed) method to shorten the length of the chromosome and thereby the searchspace, and (2) Chromosome Refinement Step (CRef) is a greedy heuristics to locally improve the fitness of...
متن کاملModified Classical Graph Algorithms for the DNA Fragment Assembly Problem
DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled. In this study, we present some graph theoretical linear time algorithms to solve the problem. To achieve linear time complexity, a heap with constant time operations was developed, for the special case where the edge weights are in...
متن کاملA Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast assembly is a crucial part of any sequencing project and many algorithms have been developed to tackle it. Since the DNA fragment assembly problem is NP-hard, exact solutions are very difficult to obtain. In this work, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Bioinformatics & Biosciences
سال: 2012
ISSN: 1839-9614
DOI: 10.5121/ijbb.2012.2205